Jaya optimization algorithm with GPU acceleration
نویسندگان
چکیده
منابع مشابه
ACO-PSO Optimization for Solving TSP Problem with GPU Acceleration
In this paper, we present a novel approach named "ACO-PSO-TSPGPU" to run PSO and ACO on Graphical Processing Units (GPUs) and applied to TSP (Parallel-PSO&ACO-A-TSP). Both algorithms are implemented on GPUs. Well-known benchmark problems for many heuristic and meta heuristic algorithms presented by Travelling Salesman Problem (TSP) are known as NP hard complex problems.TSP was investigated usin...
متن کاملGPU-based acceleration of an RNA tertiary structure prediction algorithm
Experimental techniques such as X-ray crystallography and nuclear magnetic resonance have been useful for the accurate determination of RNA tertiary structures. However, high-throughput structure determination using such methods often becomes difficult, due to the need for a large quantity of pure samples. Computational techniques for the prediction of RNA tertiary structures are thus becoming ...
متن کاملEvaluating the Power of GPU Acceleration for IDW Interpolation Algorithm
We first present two GPU implementations of the standard Inverse Distance Weighting (IDW) interpolation algorithm, the tiled version that takes advantage of shared memory and the CDP version that is implemented using CUDA Dynamic Parallelism (CDP). Then we evaluate the power of GPU acceleration for IDW interpolation algorithm by comparing the performance of CPU implementation with three GPU imp...
متن کاملLHCb GPU acceleration project
The LHCb detector is due to be upgraded for processing high-luminosity collisions, which will increase data bandwidth to the event filter farm from 100GB/s to 4 TB/s, encouraging us to look for new ways of accelerating Online reconstruction. The Coprocessor Manager is a new framework for integrating LHCb’s existing computation pipelines with massively parallel algorithms running on GPUs and oth...
متن کاملA Research of MapReduce with GPU Acceleration
MapReduce is an efficient distributed computing model on large data sets. The data processing is fully distributed on huge amount of nodes, and a MapReduce cluster is of highly scalable. However, single-node performance is gradually to be a bottleneck in computeintensive jobs, which makes it difficult to extend the MapReduce model to wider application fields such as largescale image processing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2018
ISSN: 0920-8542,1573-0484
DOI: 10.1007/s11227-018-2316-7